Chapter 18 Algorithms for the Closest and Shortest Vector Problems
نویسنده
چکیده
This is a chapter from version 1.1 of the book “Mathematics of Public Key Cryptography” by Steven Galbraith, available from http://www.isg.rhul.ac.uk/̃ sdg/crypto-book/ The copyright for this chapter is held by Steven Galbraith. This book is now completed and an edited version of it will be published by Cambridge University Press in early 2012. Some of the Theorem/Lemma/Exercise numbers may be different in the published version. Please send an email to [email protected] if you find any mistakes. All feedback on the book is very welcome and will be acknowledged.
منابع مشابه
Algorithms for the Shortest and Closest Lattice Vector Problems
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problems, namely the algorithm by Micciancio and Voulgaris based on the Voronoi cell [STOC’10], the Monte-Carlo algorithms derived from the Ajtai, Kumar and Sivakumar algorithm [STOC’01] and the enumeration algorithms origin...
متن کاملA Deterministic Single Exponential Time Algorithm for Most Lattice Problems
We give deterministic Õ(2)-time algorithms to solve all the most important computational problems on point lattices in NP, including the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), and Shortest Independent Vectors Problem (SIVP). This improves the n running time of the best previously known algorithms for CVP (Kannan, Math. Operation Research 12(3):415-440, 1987) and SIVP (Micc...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملNear-Optimal Deterministic Algorithms for Volume Computation and Lattice Problems via M-Ellipsoids
We give a deterministic 2 algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex bodies and for the shortest and closest lattice vector problems under general norms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014